#include"BinarySearchTree.h"

int main()
{
	kang::BStree<int> tree;
	
	tree.Insert(10);
	tree.Insert(1020);
	tree.Insert(120);
	tree.Insert(100);

	tree.Insert(5);
	tree.Insert(3);
	tree.Insert(7);
	tree.Insert(4);
	tree.Insert(4);
	auto it =tree.Find(4);
	if(it)
	cout << it->_key<< endl;
	tree.InOrder();
	tree.Erase(5);
	tree.Erase(10);
	tree.Erase(1020);
	tree.Erase(120);
	tree.Erase(3);
	tree.Erase(4);
	tree.Erase(100);
	tree.Erase(7);
	tree.Erase(7);
	tree.Erase(7);
	tree.Erase(7);
	tree.Erase(7);
	tree.Erase(7);
	tree.InOrder();
	return 0;
}